Cyclic Flats of a Polymatroid
نویسندگان
چکیده
منابع مشابه
The Lattice of Cyclic Flats of a Matroid
Matroid theory is a combinatorial abstraction of geometry, with flats playing the role of subspaces. Cyclic flats are special flats that contain key geometric information about a matroid. This talk presents a variety of recent results and open problems about the lattice of cyclic flats. In particular, we show that every finite lattice arises as the lattice of cyclic flats of a (fundamental tran...
متن کاملSome Properties of Cyclic Flats of an Infinite Matroid
We prove that when a pre-independence space satisfies some natural properties, then its cyclic flats form a bounded lattice under set inclusion. Additionally, we show that a bounded lattice is isomorphic to the lattice of cyclic flats of a pre-independence space. We also prove that the notion of cyclic width gives rise to dual-closed and minorclosed classes of B-matroids. Finally, we find a dif...
متن کاملPolymatroid Subdivision
A polymatroid rank function on a finite ground set E is a nondecreasing function rk : 2 → R satisfying (0) rk(∅) = 0; (2) rk(A) + rk(B) ≥ rk(A ∩ B) + rk(A ∪ B) for all A,B ⊆ E (the submodular inequality). (Note that everywhere R appears in these notes, any ordered abelian group would do just as well, though if the group is not divisible, some of the integrality statements become unimpressive an...
متن کاملComputing the Tutte Polynomial of a Matroid from its Lattice of Cyclic Flats
We show how the Tutte polynomial of a matroid M can be computed from its condensed configuration, which is a statistic of its lattice of cyclic flats. The results imply that the Tutte polynomial of M is already determined by the abstract lattice of its cyclic flats together with their cardinalities and ranks. They furthermore generalize similiar statements for perfect matroid designs and near d...
متن کاملDisjoint bases in a polymatroid
Let f : 2 → Z be a polymatroid (an integer-valued non-decreasing submodular set function with f(∅) = 0). We call S ⊆ N a base if f(S) = f(N). We consider the problem of finding a maximum number of disjoint bases; we denote by m be this base packing number. A simple upper bound on m is given by k = max{k : ∑ i∈N fA(i) ≥ kfA(N), ∀A ⊆ N} where fA(S) = f(A∪S)−f(A). This upper bound is a natural gen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Combinatorics
سال: 2020
ISSN: 0218-0006,0219-3094
DOI: 10.1007/s00026-020-00506-3